Automated verification of input completeness for NCL circuits
نویسندگان
چکیده
منابع مشابه
Automated Design and Verification of Localized DNA Computation Circuits
Simple computations can be performed using the interactions between single-stranded molecules of DNA. These interactions are typically toehold-mediated strand displacement reactions in a well-mixed solution. We demonstrate that a DNA circuit with tethered reactants is a distributed system and show how it can be described as a stochastic Petri net. The system can be verified by mapping the Petri...
متن کاملTowards a Language Based Synthesis of NCL Circuits
This paper is an attempt to provide a language front-end to synthesise asynchronous control circuits using NCL technology. The target implementation being delay insensitive (DI), the specification language should be DI as well. Delay Insensitive Sequential Processes (DISP) is a process algebra where the behaviour of asynchronous control logic blocks is expressed by the processes. We show that o...
متن کاملCompleteness and Weak Completeness Under Polynomial-Size Circuits
This paper investigates the distribution and nonuniform complexity of problems that are com plete or weakly complete for ESPACE under nonuniform reductions that are computed by polynomial size circuits P Poly Turing reductions and P Poly many one reductions A tight exponential lower bound on the space bounded Kolmogorov complexities of weakly P Poly Turing complete problems is established A Sma...
متن کاملAutomatische formale Verifikation der Fehlertoleranz von Schaltkreisen (Automated Formal Verification of Fault Tolerance for Circuits)
Zusammenfassung Die kontinuierliche Verringerung der Strukturgrößen führt zu einer erhöhten Fehleranfälligkeit von digitalen Schaltungen. Sowohl Produktionsfehler als auch transiente Fehler können die Funktionsfähigkeit beeinflussen. Deshalb wird die Untersuchung der Fehlertoleranz im Entwicklungsprozess zunehmend wichtig. In dieser Arbeit wird ein formales Verfahren zur Berechnung der Fehlerto...
متن کاملVerification of asynchronous circuits
The purpose of this thesis is to introduce proposition-oriented behaviours and apply them to the verification of asynchronous circuits. The major contribution of propositionoriented behaviours is their ability to extend existing formal notations to permit the explicit use of both signal levels and transitions. This thesis begins with the formalisation of proposition-oriented behaviours in the c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronics Letters
سال: 2018
ISSN: 0013-5194,1350-911X
DOI: 10.1049/el.2018.6068